Finding exact optimal motifs in matrix representation by partitioning
نویسندگان
چکیده
منابع مشابه
Finding exact optimal motifs in matrix representation by partitioning
MOTIVATION Finding common patterns, or motifs, in the promoter regions of co-expressed genes is an important problem in bioinformatics. A common representation of the motif is by probability matrix or PSSM (position specific scoring matrix). However, even for a motif of length six or seven, there is no algorithm that can guarantee finding the exact optimal matrix from an infinite number of poss...
متن کاملOn the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملOptimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two popular models to represent a motif. However, both representations share an important weakness by assuming that the occurrence of a nucleotide in a binding site is independent of other nucleotides. More complicated represe...
متن کاملFinding Gapped Motifs by An Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene regulatory networks and understanding gene functions. Results: In this work, we develop a novel motif finding algorithm (PSO+) using a population-based stochastic optimization technique called Particle Swarm Optimization ...
متن کاملAn exact representation of polygonal objects by C1-continuous scalar fields based on binary space partitioning
The problem considered in this work is to find a dimension independent algorithm for the generation of signed scalar fields exactly representing polygonal objects and satisfying the following requirements: the defining real function takes zer o value exactl y at th e polygon al object boun dar y; n o extr a zer o-value isosur faces sh ould be gen er ated; C con tin uity of the function in the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bioinformatics
سال: 2005
ISSN: 1367-4803,1460-2059
DOI: 10.1093/bioinformatics/bti1115